Interval quantifying mapping of hedge algebras with adding special hedge.

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fuzziness measure on complete hedge algebras and quantifying semantics of terms in linear hedge algebras

In the paper, we shall examine the fuzziness measure (FM) of terms or of complete and linear hedge algebras of a linguistic variable. The notion of semantically quantifying mappings (SQMs) previously examined by the first author will be redefined more generally and a closed relation between the FM of linguistic terms and a family of SQMs with the parameters to be the FM of primary terms and lin...

متن کامل

Closure of Hedge-automata Languages by Hedge Rewriting Closure of Hedge-automata Languages by Hedge Rewriting

We consider rewriting systems for unranked ordered terms, i.e. trees where the number of successors of a node is not determined by its label, and is not a priori bounded. The rewriting systems are defined such that variables in the rewrite rules can be substituted by hedges (sequences of terms) instead of just terms. Consequently, this notion of rewriting subsumes both standard term rewriting a...

متن کامل

Adaptive Hedge

Most methods for decision-theoretic online learning are based on the Hedge algorithm, which takes a parameter called the learning rate. In most previous analyses the learning rate was carefully tuned to obtain optimal worst-case performance, leading to suboptimal performance on easy instances, for example when there exists an action that is significantly better than all others. We propose a new...

متن کامل

Closure of Hedge-Automata Languages by Hedge Rewriting

We consider rewriting systems for unranked ordered terms, i.e. trees where the number of successors of a node is not determined by its label, and is not a priori bounded. The rewriting systems are defined such that variables in the rewrite rules can be substituted by hedges (sequences of terms) instead of just terms. Consequently, this notion of rewriting subsumes both standard term rewriting a...

متن کامل

Optimal hedge-algebras-based controller: Design and application

In previous papers, we introduced a new reasoning method based on quantifying linguistic domains, established a new fuzzy control algorithm, called hedge-algebras-based controller (HAC), and applied it to solve some fuzzy control problems. The HAC does not require fuzzy sets to provide the semantics of the linguistic terms used in the fuzzy rule system rather the semantics is obtained through t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computer Science and Cybernetics

سال: 2013

ISSN: 1813-9663,1813-9663

DOI: 10.15625/1813-9663/28/4/1916